Description Logic Programs: Combining Logic Programs with Description Logic
نویسندگان
چکیده
منابع مشابه
Rough Description Logic Programs
The Semantic Web is an extension of the current World Wide Web, and aims to help computers to understand and process web information automatically. In recent years, the integration ontologies and rules has become a central topic in the Semantic Web. Therefore, many researchers have focused their study on investigating the combination of answer set programming with description logics for the sem...
متن کاملFuzzy Description Logic Programs
Description Logic Programs (DLPs), which combine the expressive power of classical description logics and logic programs, are emerging as an important ontology description language paradigm. In this study, we present fuzzy DLPs, which extend DLPs by allowing the representation of vague/imprecise information.
متن کاملProbabilistic Description Logic Programs
Towards sophisticated representation and reasoning techniques that allow for probabilistic uncertainty in the Rules, Logic, and Proof layers of the Semantic Web, we present probabilistic description logic programs (or pdl-programs), which are a combination of description logic programs (or dl-programs) under the answer set semantics and the well-founded semantics with Poole’s independent choice...
متن کاملEmbedding Description Logic Programs into Default Logic
Description logic programs (dl-programs) under the answer set semantics formulated by Eiter et al. have been considered as a prominent formalism for integrating rules and ontology knowledge bases. A question of interest has been whether dl-programs can be captured in a general formalism of nonmonotonic logic. In this paper, we study the possibility of embedding dl-programs into default logic. W...
متن کاملLearnability of Description Logic Programs
Carin-ALN is an interesting new rule learning bias for ILP. By allowing description logic terms as predicates of literals in datalog rules, it extends the normal bias used in ILP as it allows the use of all quantified variables in the body of a clause. It also has at-least and at-most restrictions to access the amount of indeterminism of relations. From a complexity point of view Carin-ALN allo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SSRN Electronic Journal
سال: 2003
ISSN: 1556-5068
DOI: 10.2139/ssrn.460986